package leetcode100;

public class lc041 {

    public static void main(String[] args) {
        int m = 3;int n=7;
        int res = new lc041().uniquePaths(m,n);
        System.out.println("res = " + res);

    }

    public int uniquePaths(int m, int n) {
        int[][] dp = new int[m][n];

        for (int i = 0; i < m; i++) {
            dp[i][0] = 1;
        }
        for (int i = 1; i < n; i++) {
            dp[0][i] = 1;
        }

        for (int i = 1; i < m; i++) {
            for (int j=1;j<n;j++) {
                dp[i][j] = dp[i-1][j]+dp[i][j-1];
            }
        }

        return dp[m-1][n-1];
    }
}
